Parametric linear programming and anti-cycling pivoting rules
نویسندگان
چکیده
منابع مشابه
Parametric linear programming and anti-cycling pivoting rules
The traditional perturbution (or lexicographic) methods for resolving degeneracy in linear programming impose decision rules that eliminate ties in the simplex ratio rule and, therefore, restrict the choice of exiting basic variables. Bland's combinatorial pivoting rule also restricts the choice of exiting variables. Using ideas from parametric linear programming, we develop anti-cycling pivoti...
متن کاملOn Anti-cycling Pivoting Rules for the Simplex Method, Operations the Equivalence of Dantzig's Self-dual Parametric Algorithm for Linear Programs to Lemke's Algorithm for Linear Complementarity Problems Applied to Linear Programming, Technical Report
Rotterdam 9707/A (1997). 82] S. Zionts, The criss-cross method for solving linear programming problems, English title: A new, nite criss-cross method for solving linear programming problems.) 64] T. Terlaky, A convergent criss-cross method, Math. Oper. und Stat. ser. Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, Combinatorica 9 23] G...
متن کاملA pivoting algorithm for linear programming with linear complementarity constraints
We present a pivoting algorithm for solving linear programs with linear complementarity constraints. Our method generalizes the simplex method for linear programming to deal with complementarity conditions. We develop an anticycling scheme that can verify Bouligand stationarity. We also give an optimizationbased technique to find an initial feasible vertex. Starting with a feasible vertex, our ...
متن کاملParametric Linear Programming
Parametric linear programming is the study of how optimal properties depend on data parametrizations. The study is nearly as old as the field of linear programming itself, and it is important since it highlights how a problem changes as what is often estimated data varies. We present what is a modern perspective on the classical analysis of the objective value’s response to parametrizations in ...
متن کاملOn Simplex Pivoting Rules and Complexity Theory
We show that there are simplex pivoting rules for which it is PSPACE-complete to tell if a particular basis will appear on the algorithm’s path. Such rules cannot be the basis of a strongly polynomial algorithm, unless P = PSPACE. We conjecture that the same can be shown for most known variants of the simplex method. However, we also point out that Dantzig’s shadow vertex algorithm has a polyno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1988
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01580770